Equational approximations for tree automata completion
نویسندگان
چکیده
منابع مشابه
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms of a termrewriting system R is obtained by automatically constructing a finite tree automaton. The construction is parameterized by a set E of equations on terms, and we also show that the approximating automata recogni...
متن کاملCertificates for Tree Automata Completion
We consider the problem of certifying the correctness of a protocol or security API through a formal, machine-checkable proof. To this aim, we re-examine the completion algorithm for tree automata and term rewriting systems, that computes an over-approximation of regular sets of terms up to rewriting. We then define a procedure to certify, via a proof, that the result of the completion is indee...
متن کاملA Completion Algorithm for Lattice Tree Automata
When dealing with infinite-state systems, Regular Tree Model Checking approaches may have some difficulties to represent infinite sets of data. We propose Lattice Tree Automata, an extended version of tree automata to represent complex data domains and their related operations in an efficient manner. Moreover, we introduce a new completionbased algorithm for computing the possibly infinite set ...
متن کاملAlternation in Equational Tree Automata Modulo XOR
Equational tree automata accept terms modulo equational theories, and have been used to model algebraic properties of cryptographic primitives in security protocols. A serious limitation is posed by the fact that alternation leads to undecidability in case of theories like ACU and that of Abelian groups, whereas for other theories like XOR, the decidability question has remained open. In this p...
متن کاملA Tree Automata Theory for Uni cation Modulo Equational Rewriting
An extension of tree automata framework, called equational tree automata, is presented. This theory is useful to deal with uni cation modulo equational rewriting. In the manuscript, we demonstrate how equational tree automata can be applied to uni cation problems. 1 Equational Tree Languages Uni cation modulo equational theory is a central topic in automated reasoning. Tree automata are the pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2010
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2010.01.009